Analog circuit fault mode classification method

ABSTRACT

An analog circuit fault mode classification method comprises the following implementation steps: (1) collecting M groups of voltage signal sample vectors V ij  to each of fault modes F i  of the analog circuit by using a data collection board; (2) sequentially extracting fault characteristic vectors V ij   F  of the voltage signal sample vectors V ij  by using subspace projection; (3) standardizing the extracted fault characteristic vectors V ij   F  to obtain standardized fault characteristic vectors; (4) constructing a fault mode classifier based on a support vector machine, inputting the standardized fault characteristic vectors, performing learning and training on the classifier, and determining structure parameters of the classifier; and (5) completing determination of fault modes according to fault mode determination rules. The fault mode classifier of the present invention is simple in learning and training and reliable in mode classification accuracy.

TECHNICAL FIELD

The present invention relates of the field of analog circuit fault diagnosis, and more particularly, to an analog circuit fault mode classification method.

BACKGROUND

The rapid development of modern electronic and computer technologies drives more and more complicated composition and structure of electronic equipment as well as increasingly large scale thereof. To improve system safety and reliability, higher and newer requirements are raised on circuit test and diagnosis. Analog circuits in an electronic system are prone to get wrong, and analog circuit fault diagnosis has also been a “bottleneck” that restricts the circuit industry of China. It is of great theoretical values and practical significance to develop the analog circuit industry in order to conform to the new development of modern microelectronics technologies and information technologies.

At present, an analog circuit fault model classifier based on a support vector machine has the advantages that it is suitable for small sample decision, has lower requirements on the number of learning samples and can mine the classification information hidden in data under the circumstance of limited characteristic information. But its defects are that the dimensionality of the fault characteristic vectors is too large, which will increase the difficulty of learning and training of the support vector machine. In addition, different processing methods on the training data will also affect the classification accuracy of the fault mode classifier.

SUMMARY

A technical problem to be solved by the present invention is to provide an analog circuit fault mode classification method to overcome the above defects of the prior art, so as to facilitate lightening the learning and training difficulties of the fault mode classifier and improving the classification accuracy of the fault mode classifier.

According to the present invention, a fault mode classifier is constructed on the basis of a support vector machine, and fault characteristics are extracted by using a subspace projection method, then the fault characteristics are standardized, and finally the standardized fault characteristics are utilized to train the support vector machine, so that the analog circuit fault mode classifier is constructed.

A technical solution to be adopted by the present invention to solve the technical problems thereof is as follows:

An analog circuit fault mode classification method comprises the following steps:

An analog circuit fault mode classification method is characterized by comprising the following steps:

(1) collecting M groups of voltage signal sample vectors V_(ij) at a node to be tested under each of fault modes F_(i) of the analog circuit by using a data collection board, wherein i=1, 2, . . . , N, j=1, 2, . . . , V_(ij) represents a j^(th) voltage signal sample vector of a i^(th) fault mode, and N represents a total number of the fault modes;

(2) sequentially extracting fault characteristic vectors V_(ij) ^(F) of the voltage signal sample vectors V_(ij) working under the fault modes F_(i) by using subspace projection, wherein i=1, 2, . . . , N, j=1, 2, . . . , M, and V_(ij) ^(F) represents a fault characteristic vector of the j^(th) voltage signal sample under the i^(th) fault mode;

(3) standardizing the extracted fault characteristic vectors V_(ij) ^(F) to obtain standardized fault characteristic vectors {circumflex over (V)}_(ij) ^(F), wherein a computing method thereof is

${{\hat{V}}_{ij}^{F} = \frac{V_{ij}^{F}}{V_{ij}^{F}}};$

(4) sequentially constructing a binary-class support vector machine with respect to two different fault modes F_(i) ₁ and F_(i) ₂ , wherein i₁=1, 2, . . . , N, i₂=1, 2, . . . , N, (i₁≠i₂), N is the total number of the fault modes, then N(N−1)/2 different binary-class support vector machines can be constructed in total; and

(5) simultaneously feeding a standardized fault characteristic vectors to be tested into the N(N−1)/2 binary-class support vector machines for classification and determination, and counting votes according to classification results of each binary-class support vector machine; if a fault mode to be tested belongs to the fault mode F_(i), and i=1, 2, . . . , N, then adding 1 to the votes of F_(i), wherein a fault mode obtaining the most votes finally is the fault mode that the circuit to be tested belongs to.

Further, the step of extracting the fault characteristic vectors V_(ij) ^(F) by using the subspace projection in step (2) is:

(2.1) computing dimensionality of the voltage signal sample vectors V_(ij): L=length (v_(ij));

(2.2) generating an L×L dimensional Toeplitz transformation matrix Φ:

${\Phi = \begin{bmatrix} F_{11} & F_{12} & \ldots & F_{1\; L} \\ F_{12} & F_{13} & \ldots & F_{11} \\ \ldots & \ldots & \ldots & \ldots \\ F_{1\; L} & F_{11} & \ldots & F_{1{({L - 1})}} \end{bmatrix}},{wherein}$ ${F_{1\; k} = e^{{- j}\frac{2\; \pi}{L}k}},{k = 1},2,\ldots \mspace{14mu},{L;}$

(2.3) computing a projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ: V_(p)=Φ^(T)V_(ij), wherein T represents to transpose a matrix;

(2.4) computing maximum projection subspace and the fault characteristic vectors V_(ij) ^(F):

(2.4.1) initializing a subspace projection coordinate dimensionality K: K=┌ log₂(N)┐, wherein ┌•┐ represents rounding up to an integer, and N is the total number of the fault modes of the circuit to be tested;

(2.4.2) constructing a maximum projection subspace index vector I with a dimensionality of 1×K, and initializing the vector into a 1×K dimensional null vector, i.e., I=[00 . . . 0], and meanwhile constructing a counting variable p and initializing p=1;

(2.4.3) updating the maximum projection subspace index vector I: I(p)=Index(Max(|V_(p)|)), wherein I(p) herein represents the p^(th) vector value in the vector I, Max (•) represents to compute a maximum vector element, V_(p) represents the projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ, and Index(•) represents to calculate an index;

(2.4.4) determining whether p<K; if no, then performing step (2.4.5); otherwise, performing p=p+1 and using 0 to replace the maximum element in the projected vector V_(P), and retuning to step (2.4.3);

(2.4.5) using I vector elements as row index values of the Toeplitz transformation matrix Φ to extract corresponding row vectors to constitute a matrix Φ_(A) with a dimensionality of K×L;

(2.4.6) computing the maximum projection subspace Φ_(Λ) ^(†):Φ_(Λ) ^(†)=(Φ_(Λ)Φ_(Λ) ^(T))⁻¹Φ_(Λ); and

(2.4.7) computing the fault characteristic vector V_(ij) ^(F) with subspace projection: V_(ij) ^(F)=Φ_(Λ) ^(†)V_(ij).

Further, the specific step of constructing each binary-class support vector machine in step (4) is:

(4.1) constructing a binary classifier decision model

${{f(x)} = {{\sum\limits_{i}^{\overset{\_}{N}}\; {\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}/2} \right)}}} + b}},$

wherein N represents the number of training data samples, x_(i) is called as a support vector, α_(i) is a certain real number, b is a bias, and y_(i)εy={+1,−1} is a class identifier;

(4.2) dividing a training sample set: constituting the standardized fault characteristic vectors {right arrow over (V)}_(i) ₁ _(j) ^(F) and {circumflex over (V)}_(i) ₂ _(j) ^(F) under the fault modes F_(i) ₁ and F_(i) ₂ into a training sample set S={{S₊}, {S⁻}}, wherein j=1, 2, . . . , M, S₊={({right arrow over (V)}_(i) ₁ ₁ ^(F),+1), ({right arrow over (V)}_(i) ₁ ₂ ^(F)+1), . . . , ({right arrow over (V)}_(i) ₁ _(M′) ^(F)+1}, S⁻={({right arrow over (V)}_(i) ₂ ₁ ^(F),−1), ({right arrow over (V)}_(i) ₂ ₂ ^(F),−1), . . . , ({right arrow over (V)}_(i) ₂ _(M′) ^(F)−1)}, a class identifier of F_(i) ₁ is defined as +1, and a class identifier of F_(i) ₂ is defined as −1;

(4.3) using the training sample set S to train the binary classifier decision model so as to determine parameters α_(i) and b of the binary-class support vector machine;

(4.4) outputting a determination function of the binary-class support vector machine:

${y = {{sgn}\left( {{\sum\limits_{i}^{\overset{\_}{N}}\; {\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}/2} \right)}}} + b} \right)}},$

wherein sgn (•) is a sign function, and N represents the number of the training data samples; and

(4.5) completing a mode determination for a characteristic to be tested according to the decision function: determination votes during test process are performed according to the determination function; if y=1 is outputted, then the votes of the fault mode F_(i) ₁ plus 1; otherwise, the votes of the fault mode F_(i) ₂ plus 1.

Further, the specific step of using the training sample set S to train the binary classifier decision model so as to determine the parameters α_(i) and b of the binary-class support vector machine in step (4.3) is:

(4.3.1) standardizing a kernel matrix:

${\overset{\_}{K} = \begin{bmatrix} {\overset{\_}{K}}_{11} & {\overset{\_}{K}}_{12} & \ldots & {\overset{\_}{K}}_{1,{2M}} \\ {\overset{\_}{K}}_{21} & {\overset{\_}{K}}_{22} & \ldots & {\overset{\_}{K}}_{2,{2M}} \\ \vdots & \vdots & \vdots & \vdots \\ {\overset{\_}{K}}_{{2\; M},1} & {\overset{\_}{K}}_{{2\; M},2} & \ldots & {\overset{\_}{K}}_{{2\; M},{2M}} \end{bmatrix}},$

wherein k_(ij) =exp(−∥x_(i)−x_(j)∥²/2), i, j=1, 2, . . . , 2M, M represents the number of the voltage signal sample vectors collected;

D=di ag (1/sqrt (di ag (K))), wherein di ag (•) represents to compute a diagonal matrix, and sqrt (•) represents to compute a root-mean-square of matrix elements; K is updated: K←D*K*D; and K represents to the standardized kernel matrix;

(4.3.2) training a binary classifier, which a training pseudo-code is as follows:

inputting the training sample set S={{S₊}, {S⁻}};

treating process: if a class identifier y_(i)=+1, then

${\alpha_{i}^{+} = \frac{1}{M}};$

otherwise, α_(i) ⁺=0;

if a class identifier y_(i)=−1, then

${\alpha_{i}^{-} = \frac{1}{M}};$

otherwise, α_(i) ⁻=0; M represents the number of the voltage signal sample vectors collected;

α⁺=[α₁ ⁺, α₂ ⁺, . . . , α_(2M) ⁺], α⁻=[α₁ ⁻, α₂ ⁻, . . . , α_(2M) ⁻]; and

(4.3.2) computing classifier parameters:

wherein the real number α_(i)=α_(i) ⁺−α_(i) ⁻; and

the bias b=0.5((α⁺)^(T) Kα⁺−(α⁻)^(T) Kα⁻), wherein (•)^(T) represents transpose of matrix or vector; and K represents to the standardize kernel matrix.

Compared with the prior art, the present invention has the following advantages.

(1) The present invention extracts the fault characteristic vectors by using a subspace projection method in the present invention, and determines a proper dimensionality of the fault characteristic vectors according to the length of the voltage signal sample vectors, ensures the integrality of the fault characteristic information and also reduces redundant fault characteristics, and is beneficial for decreasing the learning and training difficulties of the fault mode classifier.

(2) The present invention uses a standardizing processing method to process the fault characteristic vectors, which has more apparent effects on improving the classification accuracy of the fault mode classifier.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram illustrating a flow of an analog circuit fault mode classification method according to the invention.

FIG. 2 is a block diagram illustrating steps of constructing a binary-class support vector machine according to the invention.

DETAILED DESCRIPTION

The invention will be described in details hereinafter with reference to the drawings and embodiments.

Referring to FIG. 1, an analog circuit fault mode classification method comprises the following steps:

(1) collecting M groups of voltage signal sample vectors V_(ij) at a node to be tested under each of the fault modes F_(i) of the analog circuit by using a data collection board, wherein i=1, 2, . . . , N, j=1, 2, . . . , M, V_(ij) represents a j^(th) voltage signal sample vector of a i^(th) fault mode, and N represents a total number of the fault modes;

(2) sequentially extracting fault characteristic vectors V_(ij) ^(F) of the voltage signal sample vectors V_(ij) working under the fault modes F_(i) by using subspace projection, wherein i=1, 2, . . . , N, j=1, 2, . . . , M, and V_(ij) ^(F) represents a fault characteristic vector of the j^(th) voltage signal sample under the i^(th) fault mode;

(3) standardizing the extracted fault characteristic vectors V_(ij) ^(F) to obtain standardized fault characteristic vectors {circumflex over (V)}_(ij) ^(F), wherein a computing method thereof is

${{\hat{V}}_{ij}^{F} = \frac{V_{ij}^{F}}{V_{ij}^{F}}};$

(4) sequentially constructing a binary-class support vector machine with respect to two different fault modes F_(i) ₁ and F_(i) ₂ , wherein i₁=1, 2, . . . , N, i₂=1, 2, . . . , (i₁≠i₂), N is the total number of the fault modes, then N(N−1)/2 different binary-class support vector machines can be constructed in total; and

(5) simultaneously feeding a standardized fault characteristic vectors to be tested into the N(N−1)/2 binary-class support vector machines for classification and determination, and counting votes according to classification results of each binary-class support vector machine; if a fault mode to be tested belongs to the fault mode F_(i), and i=1, 2, . . . , N, then adding 1 to the votes of F_(i) wherein a fault mode obtaining the most votes finally is the fault mode that the circuit to be tested belongs to.

The step of extracting the fault characteristic vectors V_(ij) ^(F) by using the subspace projection in step (2) is:

(2.1) computing dimensionality of the voltage signal sample vectors V_(ij): L=length(V_(ij));

(2.2) generating an L×L dimensional Toeplitz transformation matrix Φ:

${\Phi = \begin{bmatrix} F_{11} & F_{12} & \ldots & F_{1L} \\ F_{12} & F_{13} & \ldots & F_{11} \\ \ldots & \ldots & \ldots & \ldots \\ F_{1L} & F_{11} & \ldots & F_{1{({L - 1})}} \end{bmatrix}},{wherein}$ ${F_{1k} = e^{{- j}\frac{2\pi}{L}k}},{k = 1},2,\ldots \;,{L;}$

(2.3) computing a projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ: V_(p)=Φ^(T)V_(ij), wherein T represents to transpose a matrix;

(2.4) computing maximum projection subspace and the fault characteristic vectors V_(ij) ^(F):

(2.4.1) initializing a subspace projection coordinate dimensionality K: K=┌ log₂(N)┐, wherein ┌•┐ represents rounding up to an integer, and N is the total number of the fault modes of the circuit to be tested;

(2.4.2) constructing a maximum projection subspace index vector I with a dimensionality of 1×K, and initializing the vector into a 1×K dimensional null vector, i.e., I=[00 . . . 0], and meanwhile constructing a counting variable p and initializing p=1;

(2.4.3) updating the maximum projection subspace index vector I: I(p)=Index (Max(|V_(p)|)), wherein I(p) herein represents the p^(th) vector value in the vector I, Max(•) represents to compute a maximum vector element, V_(p) represents the projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ, and Index(•) represents to calculate an index;

(2.4.4) determining whether p<K; if no, then performing step (2.4.5); otherwise, p=p+1 and using 0 to replace the maximum element in the projected vector V_(p), and retuning to step (2.4.3);

(2.4.5) using I vector elements as row index values of the Toeplitz transformation matrix Φ to extract corresponding row vectors to constitute a matrix Φ_(A) with a dimensionality of K×L;

(2.4.6) computing the maximum projection subspace Φ_(Λ) ^(†): Φ_(Λ) ^(†)=(Φ_(Λ)Φ_(Λ) ^(T))⁻¹Φ_(Λ); and

(2.4.7) computing the fault characteristic vector V_(ij) ^(F) with subspace projection: V_(ij) ^(F)=Φ_(Λ) ^(†)V_(ij).

Referring to FIG. 2, the specific step of constructing each binary-class support vector machine in step (4) is:

(4.1) constructing a binary classifier decision model

${{f(x)} = {{\sum\limits_{i}^{\overset{\_}{N}}{\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}\text{/}2} \right)}}} + b}},$

wherein N represents the number of training data samples, x_(i) is called as a support vector, α_(i) is a certain real number, b is a bias, and y_(i)εy={+1,−1} is a class identifier;

(4.2) dividing a training sample set: constituting the standardized fault characteristic vectors {right arrow over (V)}_(i) ₁ _(j) ^(F) and {circumflex over (V)}_(i) ₂ _(j) ^(F) under the fault modes F_(i) ₁ and F_(i) ₂ into a training sample set S={{S₊}, {S⁻}}, wherein j=1, 2, . . . , M, S₊={({right arrow over (V)}_(i) ₁ ₁ ^(F),+1), ({right arrow over (V)}_(i) ₁ ₂ ^(F)+1), . . . , ({right arrow over (V)}_(i) ₁ _(M′) ^(F)+1}, S⁻={({right arrow over (V)}_(i) ₂ ₁ ^(F),−1), ({right arrow over (V)}_(i) ₂ ₂ ^(F),−1), . . . , ({right arrow over (V)}_(i) ₂ _(M′) ^(F)−1)}, a class identifier of F_(i) ₁ is defined as +1, and a class identifier of F_(i) ₂ is defined as −1;

(4.3) using the training sample set S to train the binary classifier decision model so as to determine parameters α_(i) and b of the binary-class support vector machine;

(4.4) outputting a determination function of the binary-class support vector machine:

${y = {{sgn}\left( {{\sum\limits_{i}^{\overset{\_}{N}}{\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}\text{/}2} \right)}}} + b} \right)}},$

wherein sgn (.) is a sign function, and N represents the number of the training data samples; and

(4.5) completing a mode determination for a characteristic to be tested according to the decision function: determination votes during test are performed according to the determination function; if y=1 is outputted, then the votes of the fault mode F_(i) ₁ plus 1; otherwise, the votes of the fault mode f_(i) ₂ plus 1.

The specific step of using the training sample set S to train the binary classifier decision model so as to determine the parameters α_(i) and b of the binary-class support vector machine in step (4.3) is:

(4.3.1) standardizing a kernel matrix:

${\overset{\_}{K} = \begin{bmatrix} {\overset{\_}{K}}_{11} & {\overset{\_}{K}}_{12} & \ldots & {\overset{\_}{K}}_{1,{2M}} \\ {\overset{\_}{K}}_{21} & {\overset{\_}{K}}_{22} & \ldots & {\overset{\_}{K}}_{2,{2M}} \\ \vdots & \vdots & \vdots & \vdots \\ {\overset{\_}{K}}_{{2M},1} & {\overset{\_}{K}}_{{2M},2} & \ldots & {\overset{\_}{K}}_{{2M},{2M}} \end{bmatrix}},$

wherein K _(ij)=exp(−∥x_(i)−x_(j)∥²/2), i, j=1, 2, . . . , 2M, M represents the number of the voltage signal sample vectors collected;

D=di ag (1/sqrt (di ag (K))), wherein di ag (•) represents to compute a diagonal matrix, and sqrt(•) represents to compute a root-mean-square of matrix elements; K is updated: K←D*K*D; and K represents to the standardized kernel matrix;

(4.3.2) training a binary classifier, which a training pseudo-code thereof is as follows:

inputting the training sample set S={{S₊}, {S⁻}};

treating process: if a class identifier y_(i)=+1, then

${\alpha_{i}^{+} = \frac{1}{M}};$

otherwise, α_(i) ⁺=0;

if a class identifier y_(i)=−1, then

${\alpha_{i}^{-} = \frac{1}{M}};$

otherwise, α_(i) ⁻=0; M represents the number of the voltage signal sample vectors collected;

α⁺=[α₁ ⁺, α₂ ⁺, . . . ,α_(2M) ⁺], α⁻=[α₁ ⁻, α₂ ⁻, . . . , α_(2M) ⁻]; and

(4.3.2) computing classifier parameters:

wherein the real number α_(i)=α_(i) ⁺−α_(i) ⁻; and

the bias b=0.5((α⁺)^(T) Kα⁺−(α⁻)^(T) Kα⁻), wherein (•)^(T) represents transpose of matrix or vector; and K represents to the standardize kernel matrix. 

1. An analog circuit fault mode classification method, comprising: (1) collecting M groups of voltage signal sample vectors V_(ij) at a node to be tested under each of fault modes F_(i) of the analog circuit by using a data collection board, wherein j=1, 2, . . . , M, i=1, 2 . . . , N, V_(ij) represents a j^(th) voltage signal sample vector of a i^(th) fault mode, and N represents a total number of the fault modes; (2) sequentially extracting fault characteristic vectors V_(ij) ^(F) of the voltage signal sample vectors V_(ij) working under the fault modes F_(i) by using subspace projection, wherein i=1, 2, . . . , N, j=1, 2, . . . , M, and V_(ij) ^(F) represents a fault characteristic vector of the j^(th) voltage signal sample under the i^(th) fault mode; (3) standardizing the extracted fault characteristic vectors V_(ij) ^(F) to obtain standardized fault characteristic vectors {circumflex over (V)}_(ij) ^(F), wherein a computing method for obtaining the standardized fault characteristic vectors is ${{\hat{V}}_{ij}^{F} = \frac{V_{ij}^{F}}{V_{ij}^{F}}};$ (4) sequentially constructing a binary-class support vector machine with respect to two different fault modes F_(i) ₁ and F_(i) ₂ , wherein i₁=1, 2, . . . , N, i₂=1, 2, . . . , N, and i₁≠i₂, N is the total number of the fault modes, then N(N−1)/2 different binary-class support vector machines can be constructed in total; and (5) simultaneously feeding a standardized fault characteristic vectors to be tested into the N(N−1)/2 binary-class support vector machines for classification and determination, and counting votes according to classification results of each binary-class support vector machine; if a fault mode to be tested belongs to the fault mode F_(i), and i=1, 2, . . . , N, then adding 1 to the votes of the fault mode F_(i), wherein a fault mode obtaining the most votes finally is the fault mode to be tested that a circuit to be tested belongs to.
 2. The analog circuit fault mode classification method according to claim 1, wherein the step of extracting the fault characteristic vectors V_(ij) ^(F) by using the subspace projection in step (2) comprises: (2.1) computing dimensionality L of the voltage signal sample vectors V_(ij): L=length(V_(ij)); (2.2) generating an L×L dimensional Toeplitz transformation matrix Φ: ${\Phi = \begin{bmatrix} F_{11} & F_{12} & \ldots & F_{1L} \\ F_{12} & F_{13} & \ldots & F_{11} \\ \ldots & \ldots & \ldots & \ldots \\ F_{1L} & F_{11} & \ldots & F_{1{({L - 1})}} \end{bmatrix}},{wherein}$ ${F_{1k} = e^{{- j}\frac{2\pi}{L}k}},{k = 1},2,\ldots \;,{L;}$ (2.3) computing a projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ: V_(p)=Φ^(T)V_(ij), wherein T represents to transpose a matrix; (2.4) computing maximum projection subspace and the fault characteristic vectors V_(ij) ^(F): (2.4.1) initializing a subspace projection coordinate dimensionality K: K=┌ log₂(N)┐, wherein ┌•┐ represents rounding up to an integer, and N is the total number of the fault modes of the circuit to be tested; (2.4.2) constructing a maximum projection subspace index vector I with a dimensionality of 1×K, and initializing the maximum projection subspace index vector into a 1×K dimensional null vector, i.e., 1=[0 0 . . . 0], and meanwhile constructing a counting variable p and initializing p=1; (2.4.3) updating the maximum projection subspace index vector I(p)=Index(Max (Max(|V_(p)|)) wherein I(p) herein represents the p^(th) vector value in the vector I, Max(•) represents to compute a maximum vector element, V_(p) represents the projected vector of the voltage signal sample vectors V_(ij) in the Toeplitz transformation matrix Φ, and Index (•) represents to calculate an index; (2.4.4) determining whether p<K; if no, then performing step (2.4.5); otherwise, performing p=p+1 and using 0 to replace the maximum element in the projected vector V_(P), and retuning to step (2.4.3); (2.4.5) using I vector elements as row index values of the Toeplitz transformation matrix Φ to extract corresponding row vectors to constitute a matrix Φ_(Λ) with a dimensionality of K×L; (2.4.6) computing the maximum projection subspace Φ_(Λ) ^(†):Φ_(Λ) ^(†)=(Φ_(Λ)Φ_(Λ) ^(T))⁻¹Φ_(Λ); and (2.4.7) computing the fault characteristic vector V_(ij) ^(F) with subspace projection: V_(ij) ^(F)=Φ_(Λ) ^(†)V_(ij).
 3. The analog circuit fault mode classification method according to claim 1, wherein the specific step of constructing each binary-class support vector machine in step (4) comprises: (4.1) constructing a binary classifier decision model ${y = {{sgn}\left( {{\sum\limits_{i}^{\overset{\_}{N}}{\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}\text{/}2} \right)}}} + b} \right)}},$ wherein N represents the number of training data samples, x_(i) is called as a support vector, α_(i) is a certain real number, b is a bias, and y_(i)εy={+1,−1} is a class identifier; (4.2) dividing a training sample set: constituting the standardized fault characteristic vectors {right arrow over (V)}_(i) ₁ _(j) ^(F) and {circumflex over (V)}_(i) ₂ _(j) ^(F) under the fault modes F_(i) ₁ and F_(i) ₂ into a training sample set S={{S₊}, {S⁻}}, wherein j=1, 2, . . . , M, S₊={({right arrow over (V)}_(i) ₁ ₁ ^(F),+1), ({right arrow over (V)}_(i) ₁ ₂ ^(F)+1), . . . , ({right arrow over (V)}_(i) ₁ _(M′) ^(F)+1}, S⁻={({right arrow over (V)}_(i) ₂ ₁ ^(F),−1), ({right arrow over (V)}_(i) ₂ ₂ ^(F),−1), . . . , ({right arrow over (V)}_(i) ₂ _(M′) ^(F)−1)}, a class identifier of F_(i) ₁ is defined as +1, and a class identifier of F_(i) ₂ is defined as −1; (4.3) using the training sample set S to train the binary classifier decision model so as to determine parameters α_(i) and b of the binary-class support vector machine; (4.4) outputting a determination function of the binary-class support vector machine: ${{f(x)} = {{\sum\limits_{i}^{\overset{\_}{N}}{\alpha_{i}y_{i}{\exp \left( {{- {{x - x_{i}}}^{2}}\text{/}2} \right)}}} + b}},$ wherein sgn (•) is a sign function, and N represents the number of the training data samples; and (4.5) completing a mode determination for a characteristic to be tested according to the determination function: determination votes during test process are performed according to the determination function; if y=1 is outputted, then the votes of the fault mode F_(i) ₁ plus 1; otherwise, the votes of the fault mode F_(i) ₂ plus
 1. 4. The analog circuit fault mode classification method according to claim 3, wherein the specific step of using the training sample set S to train the binary classifier decision model so as to determine the parameters α_(i) and b of the binary-class support vector machine in step (4.3) comprises: (4.3.1) standardizing a kernel matrix: ${\overset{\_}{K} = \begin{bmatrix} {\overset{\_}{K}}_{11} & {\overset{\_}{K}}_{12} & \ldots & {\overset{\_}{K}}_{1,{2M}} \\ {\overset{\_}{K}}_{21} & {\overset{\_}{K}}_{22} & \ldots & {\overset{\_}{K}}_{2,{2M}} \\ \vdots & \vdots & \vdots & \vdots \\ {\overset{\_}{K}}_{{2M},1} & {\overset{\_}{K}}_{{2M},2} & \ldots & {\overset{\_}{K}}_{{2M},{2M}} \end{bmatrix}},$ wherein K _(ij)=exp(−∥x_(i)−x_(j)∥²/2), i, j=1, 2, . . . , 2M, M represents the number of the voltage signal sample vectors collected; D=di ag (1/sqrt (di ag (K))), wherein di ag (•) represents to compute a diagonal matrix, and sqrt(•) represents to compute a root-mean-square of matrix elements; K is updated: K←D*K*D; and K represents to the standardized kernel matrix; (4.3.2) training a binary classifier, which a training pseudo-code is as follows: inputting the training sample set S={{S₊}, {S⁻}}; treating process: if a class identifier y_(i)=+1, then ${\alpha_{i}^{+} = \frac{1}{M}};$  otherwise, α_(i) ⁺=0; if a class identifier y_(i)=−1, then ${\alpha_{i}^{-} = \frac{1}{M}};$ otherwise, α_(i) ⁻=0; M represents the number of the voltage signal sample vectors collected; α⁺=[α₁ ⁺, α₂ ⁺, . . . ,α_(2M) ⁺], α⁻=[α₁ ⁻, α₂ ⁻, . . . , α_(2M) ⁻]; and (4.3.2) computing classifier parameters: wherein the real number α_(i)=α_(i) ⁺−α_(i) ⁻; and the bias b=0.5((α⁺)^(T) Kα⁺−(α⁻)^(T) Kα⁻), wherein (•)^(T) represents transpose of matrix or vector; and K represents to the standardize kernel matrix. 